2,623 research outputs found

    Geometries for universal quantum computation with matchgates

    Full text link
    Matchgates are a group of two-qubit gates associated with free fermions. They are classically simulatable if restricted to act between nearest neighbors on a one-dimensional chain, but become universal for quantum computation with longer-range interactions. We describe various alternative geometries with nearest-neighbor interactions that result in universal quantum computation with matchgates only, including subtle departures from the chain. Our results pave the way for new quantum computer architectures that rely solely on the simple interactions associated with matchgates.Comment: 6 pages, 4 figures. Updated version includes an appendix extending one of the result

    Discrete Wigner functions and quantum computational speedup

    Full text link
    In [Phys. Rev. A 70, 062101 (2004)] Gibbons et al. defined a class of discrete Wigner functions W to represent quantum states in a finite Hilbert space dimension d. I characterize a set C_d of states having non-negative W simultaneously in all definitions of W in this class. For d<6 I show C_d is the convex hull of stabilizer states. This supports the conjecture that negativity of W is necessary for exponential speedup in pure-state quantum computation.Comment: 7 pages, 2 figures, RevTeX. v2: clarified discussion on dynamics, added refs., published versio

    Proposed experiment for the quantum "Guess my number" protocol

    Full text link
    An experimental realization of the entanglement-assisted "Guess my number" protocol for the reduction of communication complexity, introduced by Steane and van Dam, would require producing and detecting three-qubit GHZ states with an efficiency eta > 0.70, which would require single photon detectors of efficiency sigma > 0.89. We propose a modification of the protocol which can be translated into a real experiment using present-day technology. In the proposed experiment, the quantum reduction of the multi-party communication complexity would require an efficiency eta > 0.05, achievable with detectors of sigma > 0.47, for four parties, and eta > 0.17 (sigma > 0.55) for three parties.Comment: REVTeX4, 4 pages, 1 figur
    corecore